#pragma once
#define WORDS 2                            /* number of words in packed state */
#define MAX 30000023                       /* prime size of old nodes hashtable */
#define FILENAME "A_star.txt"
//#define PROBLEMS_FILE "Problems\\fif1000.d"
#define PROBLEMS_FILE "Problems\\fif100.d"
//#define PROBLEMS_FILE "Problems\\fif100-easy.d"
#define ANALYSIS_FILE "heuristicAnalysis.txt"
#define N 4                                    /* number of squares on a side */
#define SIZE 16                                    /* total number of squares */
//#define NUMBER 1000                    /* number of problem instances to solve */
#define NUMBER 102                   /* number of problem instances to solve */
//#define NUMBER 80                   /* number of problem instances to solve */
#define MAXG 1000                                      /* maximum path length */
#define MAXH 100                                /* maximum manhattan distance */
#define WH 1                                                 /* weight of H */
#define WG 1                                                   /* weight of G */
//#define MAXF (WH*MAXH+WG*MAXG)                       /* maximum total F value */
#define FULL 30000000      /* maximum number of elements to store in hash table */
#define TPW 8                                     /* number of tiles per word */
#define _CRT_SECURE_CPP_OVERLOAD_STANDARD_NAMES 1
#define _CRT_SECURE_NO_WARNINGS
#define EXPANDED_BETWEEN_PRINTS 1000001